On the Scheduling of Systems of Heterogeneous UAVs and Fuel Service Stations for Long-Term Mission Fulfillment
نویسندگان
چکیده
2 The duration of missions that can be accomplished by unmanned aerial vehicles (UAVs) is limited by the battery or fuel capacity of its constituent UAVs. However, a system of UAVs that is supported by automated refueling bases may support long term or even indefinite duration missions in a near autonomous mode. The UAVs can return to a base, replenish their resources and resume their duties. We develop a mixed integer linear program model to formalize the problem of scheduling such a system that includes multiple bases in disparate geographic locations that are shared between the UAVs. The system consists of a heterogeneous fleet of UAVs (each with different travel speed and distance capabilities), refuel stations and mission trajectories that must be followed by at least one UAV. A UAV may hand off the mission to another in order to return to base for a fuel recharge. For two example problems, a state of-the-art MILP solver such as CPLEX is sufficient to create a schedule for the model. This is the first time that a generic scheduling model has been developed that allows mobile agents to return to service after refueling across multiple bases. In practice, the approach allows for a long-term mission to receive uninterrupted UAV service by successively handing off the task to replacement UAVs served by geographically distributed shared bases.
منابع مشابه
On the Scheduling of Systems of UAVs and Fuel Service Stations for Long-Term Mission Fulfillment
The duration of missions that can be accomplished by a system of unmanned aerial vehicles (UAVs) is limited by the battery or fuel capacity of its constituent UAVs. However, a system of UAVs that is supported by automated refueling stations may support long term or even indefinite duration missions. We develop a mixed integer linear program (MILP) model to formalize the problem of scheduling a ...
متن کاملA new Shuffled Genetic-based Task Scheduling Algorithm in Heterogeneous Distributed Systems
Distributed systems such as Grid- and Cloud Computing provision web services to their users in all of the world. One of the most important concerns which service providers encounter is to handle total cost of ownership (TCO). The large part of TCO is related to power consumption due to inefficient resource management. Task scheduling module as a key component can has drastic impact on both user...
متن کاملScheduling of Multiple Autonomous Guided Vehicles for an Assembly Line Using Minimum Cost Network Flow
This paper proposed a parallel automated assembly line system to produce multiple products having multiple autonomous guided vehicles (AGVs). Several assembly lines are configured to produce multiple products in which the technologies of machines are shared among the assembly lines when required. The transportation between the stations in an assembly line (intra assembly line) and among station...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012